MACE: A Multi-attribute Combinatorial Exchange
نویسنده
چکیده
The increasing interconnection between computers has created a vision for Grids. Within these Grids, computing resources such as processing power, storage space or applications are accessible to any participant. This accessibility has major ramifications for organizations since they can reduce costs by outsourcing nonessential elements of their IT infrastructure to various forms of service providers. Such emerging e-Utilities – providers offering on-demand access to computing resources – enable organizations to perform computational jobs spontaneously through other resources in the Grid that are not under the control of the (temporary) user (Foster et al., 2002).
منابع مشابه
MACE: multi-agents coordination engine to resolve conflicts among functional units in an enterprise
The purpose of this paper is to study how a multi-agent-based coordination mechanism can resolve con¯icts among functional units in an enterprise. In the era of information technology, characterized by web technology, intelligent agents demonstrate the best interests of a functional unit when engaged in the highly delicate coordination process of an enterprise. Thus, behavioral problems that oc...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملBidding strategy for agents in multi-attribute combinatorial double auction
In a multi-attribute combinatorial double auction (MACDA), sellers and buyers’ preferences over multiple synergetic goods are best satisfied. In recent studies in MACDA, it is typically assumed that bidders must know the desired combination (and quantity) of items and the bundle price. They do not address a package combination which is the most desirable to a bidder. This study presents a new p...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کامل